Survey-based Comparison of Chord Overlay Networks
نویسندگان
چکیده
منابع مشابه
Survey-based Comparison of Chord Overlay Networks
Chord is a structured peer-to-peer (P2P) overlay network in which participating peers share resources as equals. To find a specific data item within the network, Chord system provide a lookup mechanism that matches a given key to a network node responsible for the value associated with that key. Chord is recently proposed to become one of the new approaches for building large-scale Internet app...
متن کاملChord-over-Chord Overlay for Peer-to-Peer networks
In structured Peer-to-Peer(P2P) systems such as Chord or Pastry, each node plays an equal role and has the same responsibility. The most important advantage of such approach is scalability: since there are no centralized resources in the system, the system can easily scale to millions of nodes. However, we need to pay a high price for such scalability, as the maintenance cost of such protocols ...
متن کاملEffective Load Balancing in Overlay Chord & P Grid Networks
In structured chord & P Grid systems finding the successor nodes, Load balancing and dynamic routing are the challenging issues because nodes are heterogeneous and dynamically nodes may join the network or old node may release from network. We present a general framework, HiGLOB, for global load balancing in structured Chord systems. Current load balancing, finding optimized node and dynamic ro...
متن کاملImprovement of Chord Overlay for P2psip-based Communication Systems
Chord has been suggested by IETF P2PSIP working group as mandatory overlay technology in the future P2PSIP-based communication systems. Chord allows for the available peer/resource lookup in no more than log N hops, where N is the total number of the peers in the overlay network. However, as a protocol originally designed for background downloading applications, Chord has a few drawbacks when s...
متن کاملUnderstanding Chord Performance and Topology - aware Overlay Construction for Chord
We studied performance of the Chord scalable lookup system with several performance enhancements. For the denser finger technique, we gave analytical result that shows the average lookup path length decreases slower than the maximum length and converges to it as finger density grows higher. Location cache, as implemented in MIT Chord, is shown to be able to reduce the lookup path length by 1/2 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/11892-7942